#define _CRT_SECURE_NO_WARNINGS 1
#include<queue>
#include<iostream>
#include"priority_queue.h"
#include"test.h"
using namespace std;
void test1()
{
    int a[] = { 5,6,1,2,5,7 };
	priority_queue<int,vector<int>,greater<int>> pq(a,a + sizeof(a) / sizeof(a[0]));
	while (!pq.empty())
	{
		cout << pq.top() << " ";
		pq.pop();
	}
}
void test2()
{
	int a[] = { 2,5,1,3,4,7,4,2,1 };
	tmt::priority_queue<int, vector<int>, tmt::less<int>> pq(a,a+sizeof(a)/sizeof(a[0]));


	while (!pq.empty())
	{
		cout << pq.top() << " ";
		pq.pop();
	}

}
void test3()
{
	bit::priority_queue<int, vector<int>, tmt::greater<int>> pq;
	pq.push(1);
	pq.push(5);
	pq.push(7);
	pq.push(2);

	while (!pq.empty())
	{
		cout << pq.top() << " ";
		pq.pop();
	}
}
int main()
{
	test2();
	return 0;
}